Exact and greedy algorithms of allocating experts to maximum set of programmer teams

The allocation of experts to programmer teams, which meet constraints on professional competences related programming technologies, languages and tools an IT project specifies is a hard combinatorial problem. This paper solves the problem forming maximum number teams whose all within each team. It develops compares two algorithms: heuristic greedy exact optimal. algorithm iteratively set cover matrix expert until can create next workable team remaining experts. proves that not accurate even if exact. We call as double greedy. we propose finds optimal solution in three steps: generating non-redundant producing graph team’s independency, searching for clique graph. traverses search tree constructed such way guarantee creation absorbing redundant teams. edges independency connect have no common expert. accounts features. Experimental results show reference one, double-greedy very fast yield suboptimal solutions large-size problems.